Semidefinite and Second Order Cone Programming Seminar Fall 2012 Project: Robust Optimization and its Application of Robust Portfolio Optimization
نویسنده
چکیده
There are several different methods to treat uncertainty in literacy. First, sensitivity analysis which is a post-optimization method analyzing stability of generated solutions. Second, stochastic programming is a modeling approach, and this method is limited to that the uncertainty is stochastic in nature. Third, “Robust Mathematical Programming” is that a candidate solutions allowing to violate the “scenario realizations” of the constraints instead of considering fixed “nominal” data for several scenarios considered, and add penalty terms in the objective function. [2] The robust optimization is a method to handle deterministic uncertainty in optimization problems [4]. Majority of uncertain data are due to prediction errors, measurement errors, and implementation errors. Moreover, small errors in data values can make optimal solutions highly infeasible, and the robust optimization prevent the infeasible solutions. This paper first summarizes the basic concept of robust optimization [1] and shows its application of robust portfolio optimization.
منابع مشابه
Robust portfolio optimization: a conic programming approach
The Markowitz Mean Variance model (MMV) and its variants are widely used for portfolio selection. The mean and covariance matrix used in the model originate from probability distributions that need to be determined empirically. It is well known that these parameters are notoriously difficult to estimate. In addition, the model is very sensitive to these parameter estimates. As a result, the per...
متن کاملSemidefinite and Second Order Cone Programming Seminar Fall 2012 Project Report Shape Constraints And Its Application
In this project, I will introduce a method to estimate the function by cubic splines. As an example, I will focus on the non-homogeneous Poisson process. Since this method uses an optimization model based on the maximum likelihood principle, it may applied to other stochastic processes. The most critical point of this presentation is a nonnegativity constriant on the splines. In addition, choos...
متن کاملPrimal and dual robust counterparts of uncertain linear programs: an application to portfolio selection
This paper proposes a family of robust counterpart for uncertain linear programs (LP) which is obtained for a general definition of the uncertainty region. The relationship between uncertainty sets using norm bod-ies and their corresponding robust counterparts defined by dual norms is presented. Those properties lead us to characterize primal and dual robust counterparts. The researchers show t...
متن کاملDistributionally Robust Project Crashing with Partial or No Correlation Information
Crashing is a method for optimally shortening the project makespan by reducing the time of one or more activities in a project network by allocating resources to it. Activity durations are however uncertain and techniques in stochastic optimization, robust optimization and distributionally robust optimization have been developed to tackle this problem. In this paper, we study a class of distrib...
متن کاملTractable Approximations to Robust Conic Optimization Problems
In earlier proposals, the robust counterpart of conic optimization problems exhibits a lateral increase in complexity, i.e., robust linear programming problems (LPs) become second order cone problems (SOCPs), robust SOCPs become semidefinite programming problems (SDPs), and robust SDPs become NP-hard. We propose a relaxed robust counterpart for general conic optimization problems that (a) prese...
متن کامل